Polling on a Graph with General Arrival and Service Time Distribution Polling on a Graph with General Arrival and Service Time Distribution
نویسندگان
چکیده
Polling sur un graphe avec des temps d'inter-arriv ees et de services avec distributions g en erales Abstract Nous consid erons un syst eme de polling sur un graphe avec des temps d'inter-arriv ees, de services et de d eplacements du serveur qui forment des suites i.i.d. Nous pr esentons des conditions suusantes et n ecessaires de stabilit e, en utilisant une analyse de la d erive de la charge dans le syst eme et des temps r esiduels des inter-arriv ees, pendant les cycles. abstract We consider a polling system on a graph with general independent arrival, service and walking times. We present necessary and suucient conditions for stability, based on drift analysis of both the workload and the residual interarrival times within some embedded times called cycles.
منابع مشابه
An exact analysis of an asymmetric polling system with mixed service discipline and general service order
This paper derives the exact mean waiting time for an asymmetric polling system with general service order and mixed service discipline. The mixed service discipline means that the service discipline of each stage (a turn in the service order sequence) for the same station can be gated or exhaustive. The gene-l-al service order denotes that each station can be polled more than once in a polling...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملSojourn times in a processor sharing queue with multiple vacations
We study an M/G/1 processor sharing queue with multiple vacations. The server only takes a vacation when the system has become empty. If he finds the system still empty upon return, he takes another vacation, and so on. Successive vacations are identically distributed, with a general distribution. When the service requirements are exponentially distributed we determine the sojourn time distribu...
متن کاملOn the stability of greedy polling systems with general service policies
We consider a polling system with a finite number of stations fed by compound Poisson arrival streams of customers asking for service. A server travels through the system. Upon arrival at a non-empty station i, say, with x > 0 waiting customers, the server tries to serve there a random number B of customers if the queue length has not reached a random level C < x before the server has completed...
متن کاملWaiting times in polling systems with various service disciplines
We consider a polling system of N queues Q1, . . . , QN , cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Qi, i = 1, . . . , N , it serves a number of customers according to a certain visit discipline. This discipline is assumed to belong to the class of bran...
متن کامل